Partial Matchmaking using Approximate Subsumption
نویسنده
چکیده
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of information integration and service discovery. A drawback of the direct use of subsumption as a matching criterion is the inability to compute partial matches and qualify the degree of mismatch. In this paper, we describe a method for overcoming these problems that is based on approximate logical reasoning. In particular, we approximate the subsumption relation by defining the notion of subsumption with respect to a certain subset of the concept and relation names. We present the formal semantics of this relation, describe a sound and complete algorithm for computing approximate subsumption and discuss its application to matching tasks.
منابع مشابه
Partial Matchmaking for complex Product and Service Descriptions
Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing offers and requests and standard methods from description logics reasoning have been proposed for computing matches. We argue that classical reasoning is not well suited for realistic scenarios as it does not allow to co...
متن کاملA Little Logic Goes a Long Way - Logical Reasoning in Web Data Integration and Ontology Learning
There is an ongoing dispute in the Semantic Web Community about the usefulness of (Description) Logic as a basis for describing data on the web. While researchers in logic argue with the benefits of logic in terms of a clean semantics and richness of the language, criticism against the use of logic normally focusses on two points: its computational complexity and its inability to represent soft...
متن کاملReasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be performed only via standard SQL queries. Main contribution is in the SQL implementation of the following features: (i) compliance with four match classes (i.e., exact, full, partial and potential); (ii) rank computati...
متن کاملA purely logic-based approach to approximate matching of Semantic Web Services
Most current approaches to matchmaking of semantic Web services utilize hybrid strategies consisting of logicand non-logic-based similarity measures (or even no logic-based similarity at all). This is mainly due to pure logic-based matchers achieving a good precision, but very low recall values. We present a purely logic-based matcher implementation based on approximate subsumption and extend t...
متن کاملLogic Based Approach to Web Services Discovery and Matchmaking
We present a logic based approach to web services discovery and matchmaking in an e-commerce scenario. In particular, we describe our framework, based on Description Logics formalization and reasoning, and its deployment in a prototype, which overcomes simple subsumption matching of services descriptions and allows match ranking and services classification. We also present results of first expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007